北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (2): 84-88.doi: 10.13190/jbupt.200702.84.shut

• 论文 • 上一篇    下一篇

EFSM可执行状态验证序列的生成

舒 挺, 魏仰苏, 吴柏青, 孟兆航   

  1. (浙江理工大学 信息电子学院,杭州 310018 )
  • 收稿日期:2006-05-08 修回日期:1900-01-01 出版日期:2007-04-30 发布日期:2007-04-30
  • 通讯作者: 舒 挺

A Novel Algorithm for Generating Executable State Identification Sequences in EFSM Model

SHU Ting,WEI Yang-su,WU Bai-qing,MENG Zhao-hang   

  1. (College of Informatics and Electronics, Zhejiang SCI-TECH University, Hangzhou 310018, China)
  • Received:2006-05-08 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: SHU Ting

摘要:

在以扩展有限状态机(EFSM)为模型描述的协议一致性测试系统中,为了解决状态验证序列的可执行性问题,提出了一种新的可执行状态验证序列(ESIS)生成算法。新算法基于宽度优先搜索可执行分析树(EAT)的思想,从状态验证需求的角度,在EFSM的状态格局投影子空间中,采用分步计算的方式生成具体验证场景下的最短可执行状态验证序列,从而减少了在完全状态格局空间中单步计算所有状态验证序列的复杂性。实验结果表明了新算法对生成EFSM可执行状态验证序列是有效的。

关键词: 协议一致性测试, 扩展有限状态机, 状态验证, 唯一输入输出序列

Abstract:

In a protocol conformance testing system specified in the extended finite state machine (EFSM) model, a novel method of executable state identification sequences (ESIS) generation is introduced to preferably solve the executability problem of state identification sequences (SIS). The approach, from the aspect of state identification demand and the EFSM configure projection subspace, adopts fractional-step computation to generate the shortest ESIS in the specific identification scene through searching a executability analysis tree (EAT) in bread-first-search way. As a result, the complexity of computing all state identification sequences using single-step method in the whole state configure space is reduced. The experiment results show that the proposed algorithm is effective to generate executable state identification sequences in EFSM model.

Key words: protocol conformance test;extended finite state machine;state identification, unique input/output sequence

中图分类号: